A Fast Algorithm for Facility Location Problem

In this paper, we present an approximation algorithm achieving approximation guarantee of 2 for the classical uncapacitated facility location problem. The distinguishing feature of our designed algorithm is the overall low running time of ( log ) O m m , where c f m n n = × , c n and f n are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the running time is 3 ( ) O n , where c f n n n = + . Compared with the approximation algorithm in Ref.[1], the advantage of our algorithm is it has more applications with lower running time.